منابع مشابه
NOTE Some Non-embeddable Quasi-Derived Designs
Van Lint and Tonchev (1993, J. Combin. Theory Ser. A 62, 252 260) described a sufficient condition for the non-embeddability of a quasi-derived design into a symmetric balanced incomplete block design. In this paper, by using the notion of incomplete designs, this criterion is changed to find certain quasi-derived designs in some special cases. Many infinite series of non-embeddable quasi-deriv...
متن کاملA Class of Non-embeddable Designs
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملAn infinite Family of Non-embeddable Hadamard Designs
The parameters 2 (2λ + 2, λ + 1, λ) are those of a residual Hadamard 2 (4λ + 3, 2λ + 1, λ) design. All 2 (2λ + 2, λ + 1, λ) designs with λ ≤ 4 are embeddable. The existence of non-embeddable Hadamard 2-designs has been determined for the cases λ = 5, λ = 6, and λ = 7. In this paper the existence of an infinite family of non-embeddable 2 (2λ + 2, λ + 1, λ) designs, λ = 3(2m)− 1,m ≥ 1 is establis...
متن کاملData-Embeddable Texture Synthesis
Data hiding techniques onto images provide tools for protecting copyright or sending secret messages, and they are currently utilized as a simple input device of a cell phone by detecting a data embedded in an image with an equipped digital camera. This paper presents a method of synthesizing texture images for embedding arbitrary data by utilizing the smart techniques of generating repetitive ...
متن کاملOn cyclically embeddable graphs
An embedding of a simple graph G into its complement G is a permutation σ on V (G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider some families of embeddable graphs such that the corresponding permutation is cyclic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2016
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-016-0304-6